Anytime Classification Classifying under Computational Resource Constraints: Anytime Classification Using Probabilistic Estimators
نویسندگان
چکیده
In many online applications of machine learning, the computational resources available for classification will vary from time to time. Existing techniques are designed to operate within the constraints of the minimum expected resources and fail to utilize further resources when they are available. This paper presents an analysis of the relevant categories of computational resource involved and presents an algorithm that starts with the classification time and accuracy of naive Bayes, utilizing additional CPU time to increase classification accuracy.
منابع مشابه
Learning classifiers that perform probabilistic classification under computational resource constraints
Existing online machine learning techniques are often tuned to minimized computational resources, and are not able to utilize further resources when they are available. This is likely to result in sub-optimal learning performance in many online applications where the computational resources available will vary from time to time. This paper analyzes categories of computational resources and defi...
متن کاملLearning for anytime classification
Many on-line applications of machine learning require that the learned classifiers complete classification within strict real-time constraints. In consequence, efficient classifiers such as naive Bayes (NB) are often employed that can complete the required classification tasks even under peak computational loads. While NB provides acceptable accuracy, more computationally intensive approaches c...
متن کاملAnytime Interval-Valued Outputs for Kernel Machines: Fast Support Vector Machine Classification via Distance Geometry
Classifying M examples using a support vector machine containing L support vectors traditionally requires exactly M . L kernel computations. We introduce a computational geometry method for which classification cost becomes roughly proportional to the difficulty of each example (e.g. distance from the discriminant hyperplane). It produces exactly the same classifications, while typically requir...
متن کاملEnhanced Anytime Algorithm for Induction of Oblivious Decision Trees
Real-time data mining of high-speed and non-stationary data streams has a large potential in such fields as efficient operation of machinery and vehicles, wireless sensor networks, urban traffic control, stock data analysis etc.. These domains are characterized by a great volume of noisy, uncertain data, and restricted amount of resources (mainly computational time). Anytime algorithms offer a ...
متن کاملMulti-scale Dense Networks for Resource Efficient Image Classification
In this paper we investigate image classification with computational resource limits at test time. Two such settings are: 1. anytime classification, where the network’s prediction for a test example is progressively updated, facilitating the output of a prediction at any time; and 2. budgeted batch classification, where a fixed amount of computation is available to classify a set of examples th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005